Published in: LIPIcs, Volume 209, 35th International Symposium on Distributed Computing (DISC 2021)
Leonid Barenboim and Tzalik Maimon. Deterministic Logarithmic Completeness in the Distributed Sleeping Model. In 35th International Symposium on Distributed Computing (DISC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 209, pp. 10:1-10:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{barenboim_et_al:LIPIcs.DISC.2021.10, author = {Barenboim, Leonid and Maimon, Tzalik}, title = {{Deterministic Logarithmic Completeness in the Distributed Sleeping Model}}, booktitle = {35th International Symposium on Distributed Computing (DISC 2021)}, pages = {10:1--10:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-210-5}, ISSN = {1868-8969}, year = {2021}, volume = {209}, editor = {Gilbert, Seth}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.10}, URN = {urn:nbn:de:0030-drops-148123}, doi = {10.4230/LIPIcs.DISC.2021.10}, annote = {Keywords: Distributed Computing, Sleeping Model, Complexity Class} }
Published in: LIPIcs, Volume 184, 24th International Conference on Principles of Distributed Systems (OPODIS 2020)
Leonid Barenboim and Harel Levin. Secured Distributed Algorithms Without Hardness Assumptions. In 24th International Conference on Principles of Distributed Systems (OPODIS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 184, pp. 32:1-32:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{barenboim_et_al:LIPIcs.OPODIS.2020.32, author = {Barenboim, Leonid and Levin, Harel}, title = {{Secured Distributed Algorithms Without Hardness Assumptions}}, booktitle = {24th International Conference on Principles of Distributed Systems (OPODIS 2020)}, pages = {32:1--32:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-176-4}, ISSN = {1868-8969}, year = {2021}, volume = {184}, editor = {Bramas, Quentin and Oshman, Rotem and Romano, Paolo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2020.32}, URN = {urn:nbn:de:0030-drops-135171}, doi = {10.4230/LIPIcs.OPODIS.2020.32}, annote = {Keywords: distributed algorithms, privacy preserving, graph coloring, generic algorithms, multi-party computation} }
Feedback for Dagstuhl Publishing